Stress functions for nonlinear dimension reduction, proximity analysis, and graph drawing

نویسندگان

  • Lisha Chen
  • Andreas Buja
چکیده

Multidimensional scaling (MDS) is the art of reconstructing pointsets (embeddings) from pairwise distance data, and as such it is at the basis of several approaches to nonlinear dimension reduction and manifold learning. At present, MDS lacks a unifying methodology as it consists of a discrete collection of proposals that differ in their optimization criteria, called “stress functions”. To correct this situation we propose (1) to embed many of the extant stress functions in a parametric family of stress functions, and (2) to replace the ad hoc choice among discrete proposals with a principled parameter selection method. This methodology yields the following benefits and problem solutions: (a) It provides guidance in tailoring stress functions to a given data situation, responding to the fact that no single stress function dominates all others across all data situations; (b) the methodology enriches the supply of available stress functions; (c) it helps our understanding of stress functions by replacing the comparison of discrete proposals with a characterization of the effect of parameters on embeddings; (d) it builds a bridge to graph drawing, which is the related but not identical art of constructing embeddings from graphs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Energy/Stress Functions for Dimension Reduction and Graph Drawing: Power Laws and Their Clustering Properties∗

We introduce a parametrized family of energy/stress functions useful for proximity analysis, nonlinear dimension reduction, and graph drawing. The functions are inspired by the physics intuitions of attractive and repulsive forces common in graph drawing. Their minimization generates low-dimensional configurations (embeddings, graph drawings) whose interpoint distances match input distances as ...

متن کامل

Local Multidimensional Scaling for Nonlinear Dimension Reduction, Graph Drawing and Proximity Analysis

In the past decade there has been a resurgence of interest in nonlinear dimension reduction. Among new proposals are “Local Linear Embedding” (LLE, Roweis and Saul 2000), “Isomap” (Tenenbaum et al. 2000) and Kernel PCA (KPCA, Schölkopf, Smola and Müller 1998), which all construct global lowdimensional embeddings from local affine or metric information. We introduce a competing method called “Lo...

متن کامل

Local Multidimensional Scaling for Nonlinear Dimension Reduction, Graph Layout and Proximity Analysis

In recent years there has been a resurgence of interest in nonlinear dimension reduction methods. Among new proposals are so-called “Local Linear Embedding” (LLE) and “Isomap”. Both use local neighborhood information to construct a global lowdimensional embedding of a hypothetical manifold near which the data fall. In this paper we introduce a family of new nonlinear dimension reduction methods...

متن کامل

Data Visualization With Multidimensional Scaling

We discuss methodology for multidimensional scaling (MDS) and its implementation in two software systems, GGvis and XGvis. MDS is a visualization technique for proximity data, that is, data in the form of N × N dissimilarity matrices. MDS constructs maps (“configurations,” “embeddings”) in IRk by interpreting the dissimilarities as distances. Two frequent sources of dissimilarities are high-dim...

متن کامل

Best Proximity Point Result for New Type of Contractions in Metric Spaces with a Graph

In this paper‎, ‎we introduce a new type of graph contraction using a special class of functions and give a best proximity point theorem for this contraction in complete metric spaces endowed with a graph under two different conditions‎. ‎We then support our main theorem by a non-trivial example and give some consequences of best proximity point of it for usual graphs.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of Machine Learning Research

دوره 14  شماره 

صفحات  -

تاریخ انتشار 2013